Restricting grammatical complexity

Restricting grammatical complexity

Theories of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamental properties of grammar can and should be understood in terms of restrictions on the complexity of possible grammatical computation, when defined in terms of generative capacity. More specifically, the paper...

Grammatical Complexity and Inference

the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing

بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...

Investigating the relationship among complexity, range, and strength of grammatical knowledge of EFL students

Assessment  of  grammatical  knowledge  is  a  rather  neglected  area  of  research  in  the  field with  many  open  questions  (Purpura,  2004).  The  present  research  incorporates  recent proposals  about  the  nature  of  grammatical  development  to  create  a  framework  consisting of dimensions of complexity, range and strength, and studies which dimension(s) can best predict the stat...

Some Decidability Results on Grammatical Inference and Complexity

The grammatical inference problem is easy to state: One must choose, on the basis of a finite set of symbol strings, a grammar for the language of which the given set is a sample. Precisely the same problem arises in trying to choose a model (theory, function, etc.) to explain a collection of sample data. This is one of the most important information processing problems known and it is surprisi...